Random graph

Results: 735



#Item
21Opinion maximization in social networks Aristides Gionis∗ Evimaria Terzi†  Abstract

Opinion maximization in social networks Aristides Gionis∗ Evimaria Terzi† Abstract

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2013-01-30 17:20:26
22A Random Walk Framework to Compute Textual Semantic Similarity: a Unified Model for Three Benchmark Tasks Majid Yazdani Idiap Research Institute / EPFL Martigny / Lausanne, Switzerland

A Random Walk Framework to Compute Textual Semantic Similarity: a Unified Model for Three Benchmark Tasks Majid Yazdani Idiap Research Institute / EPFL Martigny / Lausanne, Switzerland

Add to Reading List

Source URL: majid.yazdani.me

Language: English - Date: 2015-08-19 06:57:44
23ARTICLE Received 18 Mar 2014 | Accepted 9 Jul 2014 | Published 11 Aug 2014 DOI: ncomms5630  Memory in network flows and its effects on

ARTICLE Received 18 Mar 2014 | Accepted 9 Jul 2014 | Published 11 Aug 2014 DOI: ncomms5630 Memory in network flows and its effects on

Add to Reading List

Source URL: www.jevinwest.org

Language: English - Date: 2015-09-02 17:31:18
24Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:48:33
25Spectral graph theory and its applications Daniel A. Spielman Spectral graph theory—the study of the eigenvectors and eigenvalues of matrices associated with graphs—is a large field with many beautiful results. Most

Spectral graph theory and its applications Daniel A. Spielman Spectral graph theory—the study of the eigenvectors and eigenvalues of matrices associated with graphs—is a large field with many beautiful results. Most

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2005-06-30 12:02:51
26Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset

Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset

Add to Reading List

Source URL: tuvalu.santafe.edu

Language: English - Date: 2013-11-23 11:09:17
27arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

Add to Reading List

Source URL: www.grupolys.org

Language: English - Date: 2016-05-11 06:39:57
28Gossip-Based Computation of Aggregate Information David Kempe∗, Alin Dobra, and Johannes Gehrke† Department of Computer Science, Cornell University Ithaca, NY 14853, USA {kempe,dobra,johannes}@cs.cornell.edu Abstract

Gossip-Based Computation of Aggregate Information David Kempe∗, Alin Dobra, and Johannes Gehrke† Department of Computer Science, Cornell University Ithaca, NY 14853, USA {kempe,dobra,johannes}@cs.cornell.edu Abstract

Add to Reading List

Source URL: www-bcf.usc.edu

Language: English - Date: 2007-10-12 00:29:55
29Spectral Graph Theory  Lecture 10 Random Walks on Graphs Daniel A. Spielman

Spectral Graph Theory Lecture 10 Random Walks on Graphs Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-08-17 14:43:26
30i  i “imvol2” —  — 13:06 — page 431 — #1  i

i i “imvol2” — — 13:06 — page 431 — #1 i

Add to Reading List

Source URL: netlab.caltech.edu

Language: English - Date: 2006-12-03 16:23:24